A Multiple Objective View on Robust Optimization and Stochastic Programming Kathrin Klamroth Department of Mathematics and Natural Sciences University of Wuppertal, Germany Many real world optimization problems are conta

Source URL: grk1855.tu-dortmund.de

• Mathematical optimization
• Operations research
• Mathematical analysis
• Software
• Numerical analysis
• Stochastic programming
• Robust optimization
• Stochastic
• Stochastic optimization
• Extended Mathematical Programming

Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

Source URL: vigna.di.unimi.it

• Graph theory
• Mathematics
• NP-complete problems
• NP-hard problems
• Operations research
• Travelling salesman problem
• Matching
• Eulerian path
• Hamiltonian path
• Minimum spanning tree
• Cycle
• Line graph

Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc

Source URL: www.ijimai.org

• Operations research
• Computational complexity theory
• Scheduling
• Mathematics
• Applied mathematics
• NP-hard problems
• Complexity classes
• Mathematical optimization
• Flow shop scheduling
• Makespan
• Combinatorial optimization
• Schedule

INFORMS MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn 0364-765X | eissn | 00 | 0000 | 0001

Source URL: arxiv.org

• Statistics
• Statistical theory
• Estimation theory
• Bayesian statistics
• Statistical inference
• Stochastic simulation
• Loss function
• Bayes estimator
• Reinforcement learning
• Sampling
• Posterior probability
• Confidence interval

October 17, Fall 2007 Quiz 1 Solutions Introduction to Algorithms Massachusetts Institute of Technology

Source URL: courses.csail.mit.edu

• Search algorithms
• Information retrieval
• Information science
• Hashing
• Mathematics
• Mathematical optimization
• Operations research
• Arrays
• Hash table
• Hash function
• Universal hashing
• Dynamic programming

informs MATHEMATICS OF OPERATIONS RESEARCH Vol. xx, No. x, Xxxxxxx 200x, pp. xxx–xxx ISSN 0364-765X | EISSN |0x|xx0x|0xxx

Source URL: people.cs.uchicago.edu

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

ROBERTO BATTITI, MAURO BRUNATO. The LION Way: Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, Apr 2015 http://intelligentoptimization.org/LIONbook

Source URL: intelligent-optimization.org

• Mathematical optimization
• Operations research
• Roberto Battiti
• Analysis
• Global optimization
• Applied mathematics
• Engineering

Routing by Landmarks Urs-Jakob Rüetschi, University of Zurich David Caduff, University of Zurich Frank Schulz, University of Karlsruhe Alexander Wolff, University of Karlsruhe Sabine Timpf, University of Zurich

Source URL: www.strc.ch

• Graph theory
• Mathematics
• Discrete mathematics
• Routing algorithms
• Edsger W. Dijkstra
• Network theory
• Operations research
• Search algorithms
• Shortest path problem
• A* search algorithm
• Graph
• Node

Simulation Optimization of Police Patrol District Design Using an Adjusted Simulated Annealing Approach Yue Zhang, Donald Brown Predictive Technology Laboratory, Department of Systems and Information Engineering, Univers

Source URL: ptl.sys.virginia.edu

• Scientific modeling
• Operations research
• Applied mathematics
• Metaheuristics
• Simulated annealing
• Simulation
• Numerical analysis
• Algorithm
• Computer simulation
• Annealing
• Discrete event simulation
• Mathematical optimization